Using Acceptors as Transducers

Towards Probabilistic Acceptors and Transducers for Feature Structures

Weighted finite-state acceptors and transducers (Pereira and Riley, 1997) are a critical technology for NLP and speech systems. They flexibly capture many kinds of stateful left-toright substitution, simple transducers can be composed into more complex ones, and they are EMtrainable. They are unable to handle long-range syntactic movement, but tree acceptors and transducers address this weaknes...

Finite State Transducers with Predicates and Identities

An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols. The extension is motivated by applications in natural language processing (but may be more widely applicable) as well as by the observation that transducers with predicates generally have fewer states and fewer transitions. Although the extension is fairly trivial fo...

Spiking Neural P Systems Used as Acceptors and Transducers

Efficient Inference through Cascades of Weighted Tree Transducers

Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of inference algorithms for these automata beyond formal foundations. We give a detailed description of algorithms for application of cascades of weighted tree transducers to weighted tree acceptors, connecting formal the...

Parallel intersection and serial composition of finite state transducers

We describe a linguistically expressive and easy to implement parallel semantics for quasi-deterministic finite state transducers (FSTS) used as acceptors. Algorithms are given for detemain-ing acceptance of pairs of phoneme strings given a parallel suite of such transducers and for constructing the equivalent single transducer by parallel intersection. An algorithm for constructing the serial ...